Tootfinder

Spectral Lower Bounds for Local Search
Simina Br\^anzei, Nicholas J. Recker
https://arxiv.org/abs/2403.06248 https://arxiv.org/pdf/24…

Spectral Lower Bounds for Local Search
Local search is a powerful heuristic in optimization and computer science, the complexity of which has been studied in the white box and black box models. In the black box model, we are given a graph $G = (V,E)$ and oracle access to a function $f : V \to \mathbb{R}$. The local search problem is to find a vertex $v$ that is a local minimum, i.e. with $f(v) \leq f(u)$ for all $(u,v) \in E$, using as few queries to the oracle as possible. We show that if a graph $G$ admits a lazy, irreducible, a…

This https://arxiv.org/abs/2403.06248 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csCC_…

Spectral Lower Bounds for Local Search
Local search is a powerful heuristic in optimization and computer science, the complexity of which has been studied in the white box and black box models. In the black box model, we are given a graph $G = (V,E)$ and oracle access to a function $f : V \to \mathbb{R}$. The local search problem is to find a vertex $v$ that is a local minimum, i.e. with $f(v) \leq f(u)$ for all $(u,v) \in E$, using as few queries to the oracle as possible. We show that if a graph $G$ admits a lazy, irreducible, a…